#include #include #include #include #include using namespace std; #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define FORN(i, a, b) for (int i = (a); i < (b); i++) #define REP(i, n) for (int i = 0; i < (n); i++) #define FORD(i, a, b) for (int i = (a); i >= (b); i--) #define BUG(x) cerr << #x << " = " << x << endl #define SIZE(a) ((int) a.size()) typedef pair pii; long long sq(long long x) { return x * x; } long long mySqrt(long long x) { long long res = sqrt(x); while (sq(res) >= x) { res--; } return res; } int main() { int q; cin >> q; while (q--) { long long r, k; cin >> r >> k; bool ok = false; for (long long a = 1; a < r; a++) { long long b = mySqrt(a*(2*r - a)); //trick to void overflow if (r > 20000 || 10000 * (sq(r - a) + sq(b)) > sq(100 * r - k)) { cout << r - a << " " << b << endl; ok = true; break; } } if (!ok) { cout << -1 << endl; } } return 0; }